Adaptive link communications using adaptive chaotic spread waveform

ABSTRACT

Systems ( 100 ) and methods ( 700 ) for providing a communications link with a power-limited communication transmitter ( 102 ) positioned remotely from an intended receiver system ( 104 ). The methods involve channel encoding a carrier signal with data provided at the power-limited communication transmitter to form an information signal. The methods also involve generating a chaotic spreading sequence based on a chaotic number sequence. The chaotic spreading sequence has a magnitude that is constant and a variable arbitrary phase angle comprising phase values which are uniformly distributed over a predetermined range of angles. A spread spectrum signal is formed by multiplying the information signal by the chaotic spreading sequence. The spread spectrum signal has an adjustable amplitude characteristic and a zero autocorrelation. The spread spectrum signal is transmitted from the power-limited communication transmitter to the intended receiver system.

BACKGROUND OF THE INVENTION

1. Statement of the Technical Field

The invention concerns communications. More particularly, the invention concerns an application of an adaptive chaotic spread spectrum systems and methods to adaptive link communications.

2. Description of the Related Art

There is an ongoing need to provide communications links that are optimized for communication devices located at various distances from one another. For example, direct communication links can be implemented using microwave, UHF, or VHF frequencies for line-of-sight communications. Where no line-of-sight exists between two communication devices, communications links can be implemented using earth orbiting satellites to relay communications signals. However, it is well known that implementing and maintaining wireless communications links with systems with fixed operational parameters are inefficient and can cause and be susceptible to various types of interference. Moreover, such links tend to be bandwidth limited so that data throughput is often greatly restricted. Communication systems with adaptive link parameters are known to those skilled in the art. However, certain chaotic waveforms and hybrids thereof have characteristics which provide superior capabilities in certain adaptive link applications. One such adaptive link application is non line-of-sight communication requiring assured secure communication systems, wherein levels of security and the ability to preserve the link can be traded in real time. Non line-of-sight channels often rely on multipath characteristics to enable their ability to provide such capability. However, by their very nature these channels are severe and require robust waveforms and processing. HF is an example of just such a channel.

Spread spectrum systems have the potential to provide robust communications in the severe time-varying bands. A pseudorandom number generator (PRNG) can be used as a means to generate spreading codes for such systems. A PRNG for such systems must generally utilize digital logic or a digital computer and one or more algorithms to generate a sequence of numbers. However, while the output of conventional PRNG may approximate some of the properties of random numbers, they are not truly random. For example, the output of many PRNG have cyclostationary features that can be identified by analytical processes. This is not desirable in a communication link that is intended to be secure and robust.

Chaotic systems can generally be thought of as systems which vary unpredictably unless all of its properties are known. When measured or observed, chaotic systems do not reveal any discernible regularity or order. Chaotic systems are distinguished by a sensitive dependence on a set of initial conditions and by having an evolution through time and space that appears to be quite random. However, despite its “random” appearance, chaos is a deterministic evolution.

Practically speaking, chaotic signals are extracted from chaotic systems and have random-like, non-periodic properties that are generated deterministically. In general, a chaotic sequence is one in which the sequence is empirically indistinguishable from true randomness absent some knowledge regarding the algorithm which is generating the chaos.

Some have proposed the use of multiple pseudo-random number generators to generate a digital chaotic-like sequence. However, such systems only produce more complex pseudo-random number sequences that possess all pseudo-random artifacts and no chaotic properties. While certain polynomials can generate chaotic behavior, it is commonly held that arithmetic required to generate chaotic number sequences requires an impractical implementation due to the precisions required.

Communications systems utilizing chaotic sequences offer promise for being the basis of a next generation of low probability of intercept (LPI) waveforms, low probability of detection (LPD) waveforms, and secure waveforms. While many such communications systems have been developed for generating chaotically modulated waveforms, such communications systems suffer from low throughput. The term “throughput”, as used herein, refers to the amount of data transmitted over a data link during a specific amount of time. This throughput limitation stems from the fact that a chaotic signal is produced by means of an analog chaotic circuit subject to drift.

The throughput limitation with chaos based communication systems can be traced to the way in which chaotic circuits have been implemented. The reason for reliance on analog circuits for this task has been the widely held conventional belief that efficient digital generation of chaos is impossible. Notwithstanding the apparent necessity of using analog type chaos generators, that approach has not been without problems. For example, analog chaos generator circuits are known to drift over time. The term “drift”, as used herein, refers to a slow long term variation in one or more parameters of a circuit. The problem with such analog circuits is that the inherent drift forces the requirement that state information must be constantly transferred over a communication channel to keep a transmitter and receiver synchronized.

The transmitter and receiver in coherent chaos based communication systems are synchronized by exchanging state information over a data link. Such a synchronization process offers diminishing return because state information must be exchanged more often between the transmitter and the receiver to obtain a high data rate. This high data rate results in a faster relative drift. In effect, state information must be exchanged at an increased rate between the transmitter and receiver to counteract the faster relative drift. Although some analog chaotic communications systems employ a relatively efficient synchronization process, these chaotic communications systems still suffer from low throughput.

The alternative to date has been to implement non-coherent chaotic waveforms. However, non-coherent waveform based communication systems suffer from reduced throughput and error rate performance. In this context, the phrase “non-coherent waveform” means that the receiver is not required to reproduce a synchronized copy of the chaotic signals that have been generated in the transmitter. The phrase “communications using a coherent waveform” means that the receiver is required to reproduce a synchronized copy of the chaotic signals that have been generated in the transmitter.

Chaotic waveforms have differing characteristics which are dependent on how the chaos is generated and its target application. For example, chaos can be generated with a Gaussian distribution for use in maximum entropy communication systems with maximum channel capacity or low probability of intercept and low probability detection. Gaussian distributed chaos can be used as a spreading sequence in a chaotic spread spectrum communication system. One practical downside to the use of Gaussian distributed spread spectrum chaotic communications waveforms is the peak-to-average power ratio (PAPR). Typically, the PAPR in a chaotic spread waveform is about thirteen decibels (13 dB). This means that the instantaneous peak power level of the chaotic spread waveform signal is thirteen decibels (13 dB) or twenty (20) times greater as compared to the average power level. In order to avoid significant distortion, any high power amplifier (HPA) used with such a waveform is operated at a gain level such that the instantaneous peak power levels do not result in overdriving the amplifier. However, if the PAPR is thirteen decibels (13 dB), this means that, on average, the amplifier output power is thirteen decibels (13 dB) lower than the maximum or peak power output that the HPA is capable of providing. This is sometimes referred to as HPA back-off.

For LPI/LPD applications, the reduced amplifier gain necessitated by a 13 dB PAPR is not a major concern since the goal is to reduce transmitted power as far as possible, and transmitters in such instances are not usually operated close to compression points. Other operational scenarios however, like satellite communications waveforms, power challenged systems, and anti-jamming waveforms to name a few benefit from the ability to emit as much power as possible without signal distortion to mitigate natural or hostile interference. Reducing the HPA back-off permits a higher transmitted power and therefore a direct contribution to link margin, which provides improved link communications capabilities. For example, increased signal-to-noise ratio at the receiver. Thus there is a need for chaotic waveforms that retain many of the advantages of coherent chaotic communication systems and provide a low PAPR.

SUMMARY OF THE INVENTION

Embodiments of the present invention concerns systems and methods for providing a communications link with a power-limited communication transmitter positioned remotely from an intended receiver system. The communication link is resistant to natural and artificial sources of interference. The methods involve channel encoding a carrier signal with data provided at the power-limited communication transmitter to form an information signal. The methods also involve generating a spreading sequence based on a chaotic number sequence. The spreading sequence has a magnitude that is constant and a variable arbitrary phase angle. The variable arbitrary phase angle comprises phase values which are uniformly distributed over a predetermined range of angles. The methods further involve forming a spread spectrum signal by multiplying the information signal by the spreading sequence. The spread spectrum signal has a constant amplitude and a zero autocorrelation. The spread spectrum signal is transmitted from the power-limited communication transmitter to the intended receiver system. Notably, the power-limited communication transmitter is configured to transmit information signals comprising data in a digital format.

According to an aspect of the present invention, the spreading sequence is selectively modified to induce a pseudorandom or chaotic variation in the magnitude of the spreading sequence to increase a peak to average power ratio (PAPR) of the spread spectrum signal. An average deviation of the magnitude of the spreading sequence is modified so as to selectively control the PAPR of the spread spectrum signal. The average deviation is modified in response to a measured signal to interference (S/I) ratio or an estimated S/I ratio. The measured or estimated S/I ratio is determined at the intended receiver system. The measured or estimated S/I ratio is communicated from the intended receiver system to the power-limited communication transmitter.

According to another aspect of the invention, the spreading sequence is a chaotic sequence. The chaotic sequence is generated by selecting a plurality of chaotic polynomial equations. Residue Number System (RNS) arithmetic operations are used to respectively determine a plurality of solutions for the chaotic polynomial equations. The solutions are iteratively computed and expressed as RNS residue values. A chaotic series of digits is determined in a weighted number system based on the RNS residue values.

According to another aspect of the present invention, the phase values can be selected to have a plurality of uniform distributed phase values. The number of phases is matched to subsequent signal processing to form a continuous distribution over the predetermined range of angles. The phase values are chaotically varied for each spreading chip of the spreading sequence.

According to another aspect of the present invention, the information signal, spreading sequence and spread spectrum signal are digital signals comprised of an in-phase and a quadrature component. The spread spectrum signal is converted from a digital signal to an analog RF spread spectrum signal prior to being transmitted from the power-limited communication transmitter to the intended receiver system. At the intended receiver system, a de-spreading sequence is digitally generated that is identical to the spreading sequence. The spreading and de-spreading sequences are synchronized. The spread spectrum signal is de-spread by using the de-spreading sequence to recover the information signal. Thereafter, the information signal is channel decoded to recover the data.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments will be described with reference to the following drawing figures, in which like numerals represent like items throughout the figures, and in which:

FIG. 1 is a block diagram of a coherent chaotic spread-spectrum communication system that is useful for understanding the invention.

FIG. 2 is a block diagram of the transmitter shown in FIG. 1 that is useful for understanding the invention.

FIG. 3 is a block diagram of an embodiment of the receiver shown in FIG. 1 that is useful for understanding the invention.

FIG. 4 is a conceptual diagram of the digital chaos generators of FIGS. 2-3 that is useful for understanding the invention.

FIG. 5 is a flow diagram of a method for generating a discrete chaotic sequence that is useful for understanding the invention.

FIG. 6 is a block diagram of the chaos generator of FIG. 2 that is useful for understanding the invention.

FIG. 7 is a flowchart that is useful for understanding the invention.

DETAILED DESCRIPTION

The invention will now be described more fully hereinafter with reference to accompanying drawings, in which illustrative embodiments of the invention are shown. This invention, may however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. For example, the present invention can be embodied as a method, a data processing system or a computer program product. Accordingly, the present invention can take form as an entirely hardware embodiment, an entirely software embodiment or a hardware/software embodiment.

The method is particularly suited for communications between a power-limited communication platform and a remotely located intended receiver system. Examples of such power-limited communication platforms include remote unmanned sensor platforms, handheld receivers, and earth-orbiting satellites, such as GPS satellites.

The method involves phase modulating a carrier signal using data provided at the power-limited communication platform to form an information signal. For example, the data can be any type of digital data includes sensor data collected by the remote unmanned sensor platform, geolocation data from a GPS receiver, audio, video, etc. Still, embodiments of the present invention are not limited to these specific examples.

Spread spectrum signals generated using Gaussian distributed chaotic sequences have a peak to average power ratio (PAPR) of about thirteen decibels (13 dB). This difference between peak and average power requires high power amplifier (HPA) gain to be reduced in order to avoid signal distortion. The reduction in gain is commonly referred to as HPA back-off because the gain of the amplifier must be reduced or “backed-off” from a compression point in order to ensure that the amplifier output is not distorted during times of peak signal amplitude. Notwithstanding the necessity of HPA back-off to prevent signal distortion, the technique does have its disadvantages. When HPA gain is reduced, the resulting average signal power output from the amplifier is reduced, thereby limiting its ability to overcome interference associated with natural and man-made sources. Further, when the signal must go through a multiple function repeater like a “bent pipe” satellite, the HPA gain may not be controllable. The invention overcomes this problem by providing a chaotic spread spectrum communication method which, according to one embodiment, provides a constant amplitude, zero autocorrelation (CAZAC) chaotic output signal. Alternatively, or in addition thereto, the method can include variably controlling a PAPR responsive to operational conditions. Reducing the PAPR allows the signal to be transmitted with a higher average power by a given transmitter HPA. The PAPR can be adjusted to variably transform the output signal from a chaotic CAZAC type signal to a signal which has a higher value PAPR. For example, the signal can be configured to transform a transmitted output from the chaotic CAZAC waveform to a truly Gaussian chaotic waveform that appears to the casual observer as nothing more than Gaussian noise.

The spreading sequence used with the present invention is obtained from a chaotic number sequence. For purposes of generating the chaotic CAZAC signal, the spreading sequence is characterized by a constant magnitude, but a uniformly distributed varying phase angle that varies over a contiguous range of angles. The resulting chaotic spread spectrum signal has a lower PAPR compared to spread spectrum signals where spreading sequence relies upon a spreading sequence in which both the magnitude and phase are varied either chaotically or using a hybrid chaotic phase variation and a non constant magnitude variation. This allows for increased transmitter gain settings, higher average power of transmitted signals, and improved resistance to natural and man-made interference.

In the second embodiment, the invention involves generating the spreading sequence so as to dynamically vary the PAPR. The spreading sequence is selected to produce quadrature sample pairs which have the same variable arbitrary phase angles as described above in the chaotic CAZAC variation, but can also be variable within a statistically predefined deviation range of magnitudes which is selectively variably controlled. The selective variable control of the statistical magnitude deviation of the spreading sequence advantageously allows the PAPR of the resulting signal to be variably controlled. Further, as the PAPR is increased, a high power amplifier gain setting is selectively reduced. Conversely, as the PAPR is reduced, a high power amplifier gain setting is selectively increased. Variation in the PAPR is advantageously performed in response to a detected SNR of a particular communication environment and other operational requirements. Thus, certain signal characteristics are advantageously dynamically varied on an as-needed basis in response to existing operating conditions and requirements.

A digital spread spectrum communications system for implementing the reduced PAPR spread spectrum signal will now be described with respect to FIG. 1 through FIG. 3. The communication system disclosed herein utilizes a coherent chaotic sequence spread spectrum (CCSSS) method. In this regard, the system uses a chaotic spreading sequence that is generated using a novel approach. However, it should be understood that the invention is not limited in this regard. Instead, the coherent chaotic sequence spread spectrum communication method can also be implemented using chaotic sequences with other distributions or hybrid chaotic and pseudo random sequences. Thus, a chaotic sequence can be used to affect some signal attributes while a pseudo-random number sequence can affect other signal attributes. Still, those skilled in the art will appreciate that the use of a chaotic sequence has certain advantages, and therefore the invention shall be described in that context.

Prior to being transmitted, data symbols are combined with a higher rate chaotic sequence defining a variable vector. Depending on the operating mode, spreading sequence chips have either a constant magnitude or a magnitude which is variable within a selectively chosen deviation range. In either case, the chips defined by the chaotic sequence have phase angles which vary in a chaotic manner over a pre-defined range of angles, where the quantization of said angles are matched to subsequent filtering to form a continuous distribution within the limited bandwidth of the communication signal. The higher rate chaotic sequence spreads the spectral content of the data according to a spreading ratio. The resulting signal is a practically random signal, but this randomness can be removed at the receiving end to recover the original data. In particular, the data is recovered by despreading the received signal using the same chaotic sequence which is generated at a receiver. The CCSSS system in relation to FIGS. 1 through 3 channel encodes a baseband carrier with PSK symbols. The channel encoding is one of two operations commonly known as modulation. The other operation commonly known as modulation is mixing times a local oscillator or other sequence which results in frequency translation and is also used herein.

As noted above, the CCSSS system modulates the phase modulated carrier in a chaotic manner utilizing a string of discrete time chaotic samples. The discrete time chaotic samples shall hereinafter be referred to as “chips”. The chips define the quadrature values with constant magnitude or defined variable magnitude as described herein. As will be appreciated by those familiar with direct sequence spread spectrum (DSSS) systems, each chip will generally have a much shorter duration than the duration of each of the information symbols. Thus it will be understood that the carrier is modulated using the chaotic sequence chips. Moreover, it will be understood that the chip rate associated with the chaotic sequence is much higher than the symbol rate. It should also be understood that the chaotic sequence which is utilized for generating the transmitted signal is known a priori by the receiver. Consequently, the same chaotic sequence can be used at the receiver to reconstruct the non-spread carrier or remove the effect of spreading at the receiver.

System Overview

Referring now to FIG. 1, there is provided a coherent chaotic spread-spectrum communication system 100 that is useful for understanding the present invention. The coherent chaotic spread-spectrum communication system 100 is comprised of a transmitter 102 and a receiver 104. According to an embodiment of the invention, the transmitter 102 is integrated within a power-limited communication platform such as an unmanned remote sensor platform, geolocation data from a GPS receiver, audio, video, etc. Such devices typically rely on a limited available amount of battery power and therefore must conserve transmitter power as a matter of necessity.

For convenience, the invention will be described primarily in the context of the transmitter 102 and the receiver 104. However, it should be understood that the each of these components can be integrated into a bi-directional communication system, such as transceiver 101, and transceiver 107. In such an arrangement, the transceiver 101 advantageously includes a receiver 103, and the transceiver 107 includes a transmitter 105. In such an arrangement, the receiver 103 can have a configuration which is similar to receiver 104 as hereinafter described. Similarly, transmitter 105 can have a configuration which is similar to transmitter 102. Still, embodiments of the present invention are not limited in this regard. Different circuit designs can be used in each implementation without limitation. Further, while each of the transmitter and receiver components are described herein as separate devices, it should be understood that the invention is not limited in this regard. As is well known in the art, one or more antennas, circuits and components can be shared as between the receiver and transmitter devices included in each transceiver 101, 107.

The transmitter 102 is configured to generate an amplitude-and-time-discrete baseband signal and to spread the amplitude-and-time-discrete baseband signal over a wide radio frequency band. This spreading consists of multiplying the amplitude-and-time-discrete baseband signal by a digital chaotic spreading sequence. The spreading sequence is selected to be of constant magnitude, but having statistically distributed phase variations over a predetermined range of phase angles (e.g. 0° to 360°). In a second embodiment, the spreading sequence can be selected to have a chaotic or pseudo-random magnitude which varies within a predetermined deviation range, but has phase variations over a predetermined range of phase angles (e.g. 0° to 360°). In the second embodiment, the spreading sequence can be selectively dynamically transformed from the constant magnitude associated with the chaotic CAZAC signal format to a spreading sequence having independent Rayleigh distributed magnitudes and uniform distributed phases. In either case, the product of this arithmetic operation is hereinafter referred to as a digital chaotic signal. In this regard, it should be understood that the transmitter 102 is also configured to process the digital chaotic signal to place the same in a proper analog form suitable for transmission over a communications link. The transmitter 102 is further configured to communicate analog chaotic signals to the receiver 104 via a communications link. The transmitter 102 will be described in greater detail below in relation to FIG. 2.

The receiver 104 is configured to receive transmitted analog chaotic signals from the transmitter 102. The receiver 104 is also configured to down convert, digitize, and de-spread a transmitted analog chaotic signal by correlating it with a replica of the chaotic sequence generated at the transmitter 102. The chaotic sequence is also time synchronized to the transmitted analog chaotic signal: i.e., it is coarsely synchronized with a clock reference (not shown) of the transmitter 102. The output of the arithmetic operation that de-spreads the received signal is hereinafter referred to as a de-spread signal. In this regard, it should be understood that the receiver 104 is further configured to process a de-spread signal for obtaining data contained therein. The receiver 104 is configured to convert the data into useful payload information. The receiver 104 is described in greater detail below in relation to FIG. 3.

Transmitter Detail

Referring now to FIG. 2, there is provided a bock diagram of the transmitter 102 shown in FIG. 1 that is useful for understanding the invention. It should be noted that the embodiment of FIG. 2 assumes that: (1) phase shift keying (PSK) data modulation is used; (2) no pulse shaping is applied to data symbols; (3) modulated data symbols are generated in quadrature form; and (4) chaotic spectral spreading is performed at an intermediate frequency (IF).

Referring again to FIG. 2, the transmitter 102 is comprised of a data source 202. The transmitter 102 is also comprised of a source encoder 204, a symbol data formatter 206, an acquisition data generator 208, a transmitter controller 210, a multiplexer 214, a channel encoder 216, a precision real time reference 212, and a digital complex multiplier 224. The transmitter 102 is further comprised of a chaos generator 218, a uniform statistics to quadrature mapping device (USQM) 220, and a sample rate matching filter (SRMF) 222. The transmitter 102 is further comprised of an interpolator 226, a digital local quadrature oscillator (LO) 230, a real part of a complex multiplier 228, a digital-to-analog converter (DAC) 232, an anti-image filter 234, an intermediate frequency (IF) to radio frequency (RF) conversion device 236, a high power amplifier (HPA) 237, and an antenna element 238. Each of the above listed components 202-216, 222-238 are well known to persons skilled in the art. Thus, these components will not be described in great detail herein. However, a brief discussion of the transmitter 102 architecture is provided to assist a reader in understanding the present invention.

Referring again to FIG. 2, the data source 202 is configured to receive bits of data from an external data source (not shown) as bits of data. In this regard, it should be appreciated that the data source 202 is an interface configured for receiving an input signal containing data from an external device (not shown). The data source 202 is further configured to supply bits of data to the source encoder 204 at a particular data transfer rate. The source encoder 204 can be configured to encode the data received from the external device (not shown) using a forward error correction coding scheme. The bits of data received at or generated by the source encoder 204 represent any type of information that may be of interest to a user. The source encoder 204 is further configured to supply bits of data to the symbol data formatter 206 at a particular data transfer rate.

The symbol data formatter 206 is configured to process bits of data for forming channel encoded symbol data. In a preferred embodiment, the source encoded symbols are phase shift keyed (PSK) encoded. If it is desired to use a non-coherent form of PSK with the coherent chaos spread spectrum system, then the symbol data formatter 206 can also be configured to differentially encode formed PSK symbol data. Differential encoding is well known to persons skilled in the art and therefore will not be described in great detail herein. The symbol data formatter 206 can be further configured to communicate non-differentially encoded PSK symbol data and/or differentially encoded PSK symbol data to the multiplexer 214. Still, embodiments of the present invention are not limited in this regard.

According to an embodiment of the invention, the symbol data formatter 206 is functionally similar to a serial in/parallel out shift register where the number of parallel bits out is equal to log base two (log2) of the order of the channel encoder 216. In this regard, the symbol data formatter 206 is selected for use with a quadrature phase shift keying (QPSK) channel encoder. As such, the symbol data formatter 206 is configured to perform a QPSK formatting function for grouping two (2) bits of data together to form a QPSK symbol data word (i.e., a single two bit parallel word). Thereafter, the symbol data formatter 206 communicates the encoded QPSK symbol data word to the multiplexer 214. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, the symbol data formatter 206 is functionally similar to a serial in/parallel out shift register where the number of parallel bits out is equal to log base two (log2) of the order of the channel encoder 216. In this regard, the symbol data formatter 206 is selected for use with a binary phase shift keying (BPSK) modulator. As such, the symbol data formatter 206 is configured to map one bit of data to a BPSK symbol. Thereafter, the symbol data formatter 206 communicates the BPSK symbol data word to the multiplexer 214. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, the symbol data formatter 206 is selected for use with a sixteen quadrature amplitude modulation (16QAM) modulator. As such, the symbol data formatter 206 is configured to map four (4) bits to a 16QAM symbol data word. Thereafter, the symbol data formatter 206 communicates the 16QAM symbol data word to the multiplexer 214. Still, embodiments of the present invention are not limited in this regard. For example, and without limitation, an embodiment of the invention can also utilize pulse amplitude modulation.

According to another embodiment of the invention, the symbol data formatter 206 is selected for use with a binary amplitude shift keying (ASK) modulator. As such, the symbol data formatter 206 is configured to map one bit of data to a ASK symbol data word. Thereafter, the symbol data formatter 206 communicates the ASK symbol data word to the multiplexer 214. Still, embodiments of the present invention are not limited in this regard.

The transmitter 102 also includes an acquisition data generator 208 capable of generating a “known data preamble” that can be used to enable initial synchronization of a chaotic sequence generated in the transmitter 102 and the receiver 104. The duration of this “known data preamble” is determined by an amount required by the receiver 104 to synchronize with the transmitter 102 under known worst case channel conditions. In some embodiments of the invention, the “known data preamble” is a repetition of the same known symbol. In other embodiments of the invention, the “known data preamble” is a series of known symbols. The acquisition data generator 208 can be further configured to communicate the “known data preamble” to the multiplexer 214.

Referring again to FIG. 2, the multiplexer 214 is configured to receive the binary word to be modulated by the channel encoder from the symbol data formatter 206. The multiplexer 214 is also configured to receive a “known data preamble” from the acquisition data generator 208. The multiplexer 214 is coupled to the transmitter controller 210. The transmitter controller 210 is configured to control the multiplexer 214 so that the multiplexer 214 routes the “known data preamble” to the channel encoder 216 at the time of a new transmission.

According to an alternative embodiment of the invention, the “known data preamble” is stored in a modulated form. In such a scenario, the architecture of FIG. 2 is modified such that the multiplexer 214 exists after the channel encoder 216. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, the “known data preamble” may be injected at known intervals to aid in periodic resynchronization of the chaotic sequence generated in the transmitter 102 and the receiver 104. This would typically be the case for an implementation meant to operate in harsh channel conditions. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 2, the multiplexer 214 is configured to select the symbol data words to be routed to the channel encoder 216 after a preamble period has expired. The multiplexer 214 is also configured to communicate the symbol data words to the channel encoder 216. In this regard, it should be appreciated that a communication of the symbol data words to the channel encoder 216 is delayed by a time defined by the length of the “known data preamble.” As should be appreciated, this delay allows all of a “known data preamble” to be fully communicated to the channel encoder 216 prior to communication of the symbol data words.

Referring again to FIG. 2, the channel encoder 216 is configured to perform actions for representing the “known data preamble” and the symbol data words in the form of modulated amplitude-and-time-discrete digital signal symbols. The modulated amplitude-and-time-discrete digital signal is defined by digital words which represent intermediate frequency (IF) modulated symbols comprised of bits of data having a one (1) value or a zero (0) value. Methods for representing digital symbols by an amplitude-and-time-discrete digital signal are well known to persons skilled in the art. Thus, such methods will not be described in great detail herein. However, it should be appreciated that the channel encoder 216 can employ any such method. For example, the channel encoder 216 can be selected as a digital baseband modulator employing quadrature phase shift keying (QPSK). As will be appreciated by those skilled in the art, the output of the QPSK channel encoder will include an in-phase (“I”) data and quadrature phase (“Q”) data. The I and Q data will be thereafter communicated to the digital complex multiplier 224.

According to an embodiment of the invention, the transmitter 102 is further comprised of a sample rate matching device (not shown) between the channel encoder 216 and the digital complex multiplier 224. The sample rate matching device (not shown) is provided for registering the amplitude-and-time-discrete digital channel encoded signal for a symbol duration. As should be appreciated, the sample rate matching device (not shown) holds the symbol values constant so that a sample rate of the amplitude-and-time-discrete digital signal is an integer sub multiple of the digital chaotic sequence communicated to the digital complex multiplier 224. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 2, the digital complex multiplier 224 performs a complex multiplication in the digital domain. In the digital complex multiplier 224, the amplitude-and-time-discrete digital signal from the channel encoder 216 is multiplied by a digital representation of a chaotic sequence. The chaotic sequence is generated in the chaos generator 218. The rate at which the digital chaotic sequence is generated is chosen substantially higher than the data symbol rate; the ratio of the digital chaotic sequence rate and the data symbol rate is commonly called the “spreading ratio.” The greater the ratio between the data symbol period and the sample period of the digital chaotic sequence, the higher a spreading ratio. In some embodiments of the present invention, the spreading ratio may be varied in response to external commands by the transmitter controller 210, thus allowing an increase/decrease in the spreading gain obtained at the receiver 104. The chaos generator 218 communicates the chaotic sequence to USQM 220.

The USQM 220 has a first and second operating mode. The operating mode is selected by a control processor which, in this embodiment, is transmitter controller 210. In the first operating mode, the USQM 220 is configured to cause transmitter 102 to produce a CAZAC output signal. In the first operating mode, the USQM 220 is configured to transform each digital chaotic sequence value to a corresponding quadrature form represented by I and Q values. The sequence of I and Q values are constrained to having a magnitude that advantageously remains constant for each I, Q pair in the sequence. Significantly, however, the phase angle defined by each pair of I, Q values will vary from one quadrature pair to the next such that the sequence of quadrature output values has uniformly distributed phase angles within a predefined range of possible phase angles. Stated differently, it can be said that the sequence of I, Q values define a sequence of spreading chips having a constant magnitude but variable phase angle characterized by values which are statistically uniformly distributed continuous to the level of quantization within a predefined range.

In the second operating mode, the USQM 220 is configured to cause transmitter 102 to produce a spread spectrum signal which is not CAZAC, but has a variable PAPR. More particularly, in the second operating mode, the USQM 220 is configured to statistically transform a digital chaotic sequence into a transformed digital chaotic sequence with chosen statistical properties. For example, the USQM 220 may take in two (2) uniformly distributed real inputs from the chaos generator 218 and convert those via a complex-valued bivariate Gaussian transformation to a quadrature output. The quadrature output can be chosen instead to have selectively variable statistical characteristics. For example, the statistical characteristics can be that of additive white Gaussian noise or a selectively modified version of such Gaussian noise having a truncated range of magnitude distributions.

More particularly, in the second operating mode, the quadrature output of USQM 220 is adaptively controlled so that the magnitude values can be selectively restricted to a reduced or truncated range. The reduced or truncated magnitude range can vary between some maximum statistical range associated with the Gaussian noise, and a minimum range, which is the same or approximately the same as the quadrature output produced USQM 220 in the first operating mode.

It should be understood that any pre-defined phase angle range can be selected for the purposes of the present invention. For example, phase angle ranges of 0° to 180°, 0° to 270°, or 90° to 360° can be used without limitation. Still, it is advantageous to use a relatively large range of phase angles such as a range from 0° to 360°. Conversions or mappings as described herein and performed by USQM 220 will be readily understood by those skilled in the art, and therefore will not be described in great detail. However, it should be understood that techniques used to perform such conversions or mappings may include the use of nonlinear processors, look-up tables, iterative processing (CORDIC functions), or other similar mathematical processes. The USQM 220 is further configured to communicate transformed chaotic sequences to the SRMF 222.

The I, Q values output from USQM 220 have a multi-bit resolution comparable with a resolution of the DAC 232. The USQM 220 communicates the transformed digital chaotic sequence to the SRMF 222. For example, the USQM 220 communicates an in-phase (“I”) data and quadrature phase (“Q”) data to the SRMF 222 when oversampling of the chaotic sequence is required to support subsequent signal processing operations, for example, sidelobe suppression (not shown). The chaotic sequence can therefore be resampled in the SRMF 222. For example, SRMF 222 can be comprised of a real sample rate matching filter to resample each of the in-phase and quadrature-phase processing paths of the chaotic sequence. The SRMF 222 is also configured to communicate a resampled, transformed digital chaotic sequence to the digital complex multiplier 224. More particularly, the SRMF 222 communicates an in-phase (“I”) data and quadrature phase (“Q”) data to the digital complex multiplier 224. Still, embodiments of the present invention are not limited in this regard.

The digital complex multiplier 224 performs a complex multiplication on the digital chaotic sequence output from the SRMF 222 and the amplitude-and-time-discrete digital signal output from the channel encoder 216. The resulting output is a digital representation of a coherent chaotic sequence spread spectrum modulated IF signal in which the digital data from the channel encoder 216 has been spread over a wide frequency bandwidth in accordance with a chaotic sequence generated by the chaos generator 218.

The digital complex multiplier 224 is configured to combine a digital chaotic sequence with an amplitude-and-time-discrete digital signal using an arithmetic operation. The arithmetic operation is selected as a complex-valued digital multiplication operation. The complex-valued digital multiplication operation includes multiplying the amplitude-and-time-discrete digital signal by the digital chaotic sequence to obtain a digital chaotic output signal. The digital complex multiplier 224 is also configured to communicate digital chaotic output signals to the interpolator 226.

The interpolator 226, real part of complex multiplier 228 and quadrature digital local oscillator 230 operate in tandem to form an intermediate frequency (IF) translator which frequency modulates a quadrature first intermediate frequency (IF) signal received from the complex multiplier to a second real intermediate frequency (IF) signal. Such digital intermediate frequency (IF) translators are known to those skilled in the art and shall not be discussed in detail here.

The interpolator 226 accepts an input from the complex multiplier 224. In a preferred embodiment the modulated symbols are in quadrature form and the interpolator is implemented as two real interpolators. Still, embodiments of the present invention are not limited in this regard. The interpolator 226 raises the sample rate of the amplitude-and-time-discrete digital signal received from the complex multiplier 224 to a rate compatible with the bandwidth and center frequency of the second IF. The digital local oscillator 230 generates a complex quadrature amplitude-and-time-discrete digital sinusoid at a frequency which shall translate the first intermediate frequency (IF) to a desired second intermediate frequency (IF). The quadrature digital local oscillator 230 is also configured to pass its output to the real part of complex multiplier 228.

The real part of complex multiplier 228 is configured to accept as its inputs the quadrature output of the interpolator 228 and the quadrature output of the quadrature digital local oscillator 230. The real part of a complex multiplication is passed so that the real part of complex multiplier 228 implements only the real output portion of a complex multiplication. The real part of complex multiplier 228 is configured to pass its output to the DAC 232. Still, embodiments of the present invention are not limited in this regard.

According to an embodiment of the invention, the digital chaotic sequence and the amplitude-and-time-discrete digital signal are zero intermediate frequency (IF) signals. The digital chaotic sequence is used to amplitude modulate the “known data preamble” and the data symbols via an efficient instantiation of a complex multiplier. The result of this amplitude modulation process is a zero IF signal. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 2, complex multiplier 228 is configured to communicate a sampled digital chaotic output signal (i.e., a digital chaotic output signal having an increased sampling rate and non-zero intermediate frequency) to the DAC 232. The DAC 232 is configured to convert a sampled digital chaotic output signal to an analog signal. The DAC 232 is also configured to communicate an analog signal to the anti-image filter 234.

In some applications, it can be desirable to change a sampling rate at the output of the digital complex multiplier 224 only, for example when using an interpolating DAC. According to an embodiment of the invention, the digital complex multiplier 224 multiplies I and Q data of an amplitude-and-time-discrete digital signal by I and Q data of digital chaotic sequence to obtain a digital chaotic output signal. The digital chaotic output signal is a quadrature, zero IF signal. The DAC 232 is an interpolating DAC that increases the effective sample rate. The DAC 232 also up converts a real output component by a sub multiple of the interpolated sample frequency before conversion to an analog signal. The output of the DAC 232 is thus a real signal centered at some intermediate frequency. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, the digital complex multiplier 224 communicates the quadrature, zero IF signal to the IF translator. The IF translator is an interpolation filter 226 only. The interpolation filter 226 is comprised of dual real interpolators which change the sample rate of the quadrature, zero IF signal to a predetermined frequency. The interpolation filter 226 communicates the sampled, quadrature, zero IF signal to the DAC 232. The DAC 232 is an interpolating DAC that increases the effective sample rate. The DAC 232 also up converts a real output component by a sub multiple of the interpolated sample frequency before conversion to an analog signal. The output of the DAC 232 is thus a real signal centered at some intermediate frequency. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 2, the anti-image filter 234 is configured to remove spectral images from the analog signal to form a smooth time domain signal. The anti-image filter 234 is also configured to communicate a smooth time domain signal to an RF translator 236. The RF translator 236 is a wide bandwidth analog IF to RF up converter. The RF translator 236 is configured to center a smooth time domain signal at an RF for transmission thereby forming an RF signal. The RF translator 236 is also configured to communicate the RF signal to high power amplifier (HPA) 237. The HPA 237 is configured to amplify an input RF signal. The HPA 237 is configured to communicate the amplified RF signal to the antenna element 238 for communication to a receiver 104 (described below in relation to FIG. 3).

It should be understood that the quality of the signal that is emitted from the antenna 238 may be affected by the HPA 237 if the input signal from the RF Translator 236 to the HPA 237 causes the HPA to compress. Compression points of HPAs 237 are well known in the art, so will not be discussed in detail here; however, it should be noted that amplifier compression can cause unwanted signal distortions in the output 106, requiring gain reduction, or HPA back-off, to maintain the output signal in the sufficiently linear region of the amplifier. In the present invention, HPA back-off is automatically dynamically controlled by transmitter controller 210 in conjunction with selectively varying the output of USQM 220. As the transmitter controller 210 causes USQM 220 to increase the amount of variation or deviation in the magnitude of its spreading sequence output, the transmitter controller 210 causes the gain of HPA 237 to be decreased. Control systems suitable for varying the gain of HPA 237 are well known in the art, and therefore will not be described here in detail.

It should be understood that the digital generation of the digital chaotic sequence at the transmitter 102 and receiver 104 is kept closely coordinated under the control of a precision real time reference 212 clock. The higher the precision of the clock 212, the closer the synchronization of the chaos generator 218 of the transmitter 102 and the chaos generator (described below in relation to FIG. 3) of the receiver 104 shall be excluding the effects of processing delay differences and channel propagation times. The use of a precision real time reference allows the states of the chaos generators to be easily controlled with precision.

Referring again to FIG. 2, the precision real time reference 212 is a stable local oscillator locked to a precision real time reference, such as a GPS clock receiver or a chip scale atomic clock (CSAC). The precision real time reference 212 is configured to supply a high frequency clock to the clocked logic circuits 204 through 232 while being locked to a lower frequency reference clock. The lower frequency reference clock supplies a common reference and a common real time of day reference to prevent a large drift between the states of the chaos generator 218 and the chaos generator (described below in relation to FIG. 3) of the receiver 104 over an extended time interval.

A person skilled in the art will appreciate that the transmitter 102 is one architecture of a communications system transmitter. However, the invention is not limited in this regard and any other transmitter architecture can be used without limitation. For example, the transmitter 102 can include real first to second intermediate frequency (IF) translation instead of a quadrature first to second intermediate frequency (IF) translation. As another example, other architectures may employ additional chaotic sequence generators to provide a switched chaotic output or to control other aspects of the transmitter 102.

Receiver Detail

Referring now to FIG. 3, there is provided a block diagram of the receiver 104 of FIG. 1 that is useful for understanding the invention. It should be noted that in conventional analog based coherent communications systems analog chaos circuits are synchronized by periodically exchanging state information. The exchange of state information requires a substantial amount of the transmitted bandwidth. This is what makes analog based coherent communications impracticable. The receiver 104 of FIG. 3 is designed to eliminate the drawbacks of conventional analog based coherent communications systems. In this regard it should be appreciated that the receiver 104 is comprised of a digital chaos generator. The receiver 104 includes a tracking loop for synchronizing its digital chaos generator and the digital chaos generator 218 of the transmitter 102. Most significantly, the receiver is configured to synchronize two (2) strings of discrete time chaotic samples (i.e., chaotic sequences) without using a constant or periodic transfer of state update information. A first string of discrete time chaotic samples is generated at the transmitter 102. A second string of discrete time chaotic samples is generated at the receiver 104.

Referring again to FIG. 3, the receiver 104 is comprised of an antenna element 302, a low noise amplifier (LNA) 304, a zonal filter 306, an AGC amplifier 308, a radio frequency (RF) to intermediate frequency (IF) conversion device 310, an anti-alias filter 312, and an analog-to-digital (A/D) converter 314. The receiver 104 is also comprised of real multipliers 316, 318, low pass filters 354, 356, a loop control circuit 320, a quadrature digital local oscillator 322, a correlator 328, multiplexers 346, 348, a channel encoded acquisition data generator (CEADG) 350, digital complex multipliers 324, 352, and a symbol timing recovery circuit 326. The receiver 104 is further comprised of a receiver controller 338, a precision real time reference clock 336, a hard decision device 330, a symbol to bits (S/B) converter 332, and a source decoder 334. The receiver 104 is comprised of a chaos generator 340, a uniform statistic to quadrature mapper (USQM) 342, and a re-sampling filter 344. Each of the above listed components and circuits 302-318, 322-326, 330-338, 344-356 are well known to persons skilled in the art. Thus, these components and circuits will not be described in great detail herein. However, a brief discussion of the receiver 104 architecture is provided to assist a reader in understanding the present invention. It should be noted that when the receiver 104 is in both acquisition and tracking modes (described below) the receiver 104 is utilizing a novel architecture/algorithm.

Referring again to FIG. 3, the antenna element 302 is configured to receive an analog input signal communicated from the transmitter 102 over a communications link. The antenna element 302 is also configured to communicate the analog input signal to the LNA 304. The LNA 304 is configured to amplify a received analog input signal while adding as little noise and distortion as possible. The LNA 304 is also configured to communicate an amplified, analog input signal to the zonal filter 306. Zonal filters are analog filters with slow roll off characteristic but low injection loss used to suppress large interfering signals outside of bands of interest. Zonal filters are well known to persons skilled in the art, and therefore will not be described in great detail herein. It should be appreciated that the zonal filter 306 is configured to communicate a filtered, analog input signal to the automatic gain control (AGC) amplifier 308. An automatic gain control (AGC) amplifier 308 is a controllable gain amplifier used to keep the magnitude of the received signal within normal bounds for the rest of the signal processing chain. Automatic gain control (AGC) amplifiers are well known to persons skilled in the art, and therefore will not be described in great detail herein. It should be appreciated that the automatic gain control (AGC) amplifier 308 is configured to communicate a gain adjusted, analog input signal to the RF to IF conversion device 310.

The RF to IF conversion device 310 is configured to mix the analog input signal to a preferred IF for conversion to a digital signal at the A/D converter 314. The RF to IF conversion device 310 is also configured to communicate a mixed analog input signal to the anti-alias filter 312. The anti-alias filter 312 is configured to restrict a bandwidth of a mixed analog input signal. The anti-alias filter 312 is also configured to communicate a filtered, analog input signal to the A/D converter 314. The A/D converter 314 is configured to convert a received analog input signal to a digital signal. The A/D converter 314 is also configured to communicate a digital input signal to a second IF translator which is comprised of the real multipliers 316, 318, low pass filters 354,356, and the programmable quadrature digital local oscillator 322.

The multiplier 316 is configured to receive a digital word as input from the A/D converter 314 and a digital word from the in-phase component of the quadrature digital local oscillator 322. The multiplier 316 multiplies the output of the A/D converter 314 by the in-phase component of the quadrature digital local oscillator 322. The multiplier 316 is also configured to communicate a digital output word. The multiplier 318 is configured to receive a digital word as input from the A/D converter 314 and a digital word from the quadrature-phase component of the quadrature digital local oscillator 322. The multiplier 318 multiplies the output of the A/D converter 314 by the quadrature-phase component of the quadrature digital local oscillator 322. The multiplier 318 is also configured to communicate a digital output word.

The low pass filter 354 low pass is generally configured for filtering the baseband output of multiplier 316. The low pass filter 354 is also configured to communicate a digital output word. The low pass filter 356 is generally configured for filtering the baseband output of multiplier 318. The low pass filter 356 is also configured to communicate a digital output word. The output of low pass filters 354, 356 is collectively a quadrature baseband IF signal.

The quadrature digital local oscillator 322 generates a complex quadrature amplitude-and-time-discrete digital sinusoid at a frequency which shall translate the first IF to baseband and remove detected frequency and phase offsets in the resulting quadrature baseband signal. The quadrature digital local oscillator accepts as its inputs a binary phase control word and a binary frequency control word from the loop control circuit 320. Quadrature digital local oscillators are known to those skilled in the art, and therefore will not be described in detail herein.

The IF translator is configured to mix the digital input signal to a preferred IF for processing at the correlator 328 and the digital complex multiplier 324. The IF translator is also configured to communicate a digital input signal to the correlator 328 and the digital complex multiplier 324. As will be appreciated by those skilled in the art, the output of the IF translator can include an in-phase (“I”) data and quadrature phase (“Q”) data. As such, the IF translator can communicate I and Q data to the correlator 328 and the digital complex multiplier 324.

The digital complex multiplier 324 is configured to perform a complex multiplication in the digital domain. In the complex-valued digital multiplier 324, the digital input signal from the IF translator is multiplied by a digital representation of a chaotic sequence. The chaotic sequence is generated in the chaos generator 340. The chaos generator 340 communicates the chaotic sequence to USQM 342. In this regard, it should be appreciated that the chaos generator 340 is coupled to the receiver controller 338. The receiver controller 338 is configured to control the chaos generator 340 so that the chaos generator 340 generates a chaotic sequence with the correct initial state when the receiver 104 is in an acquisition mode and a tracking mode.

The USQM 342 is configured to transform a digital chaotic sequence into a quadrature form. In particular, USQM 342 converts independent uniformly distributed random variables to a pair of quadrature variables (I, Q values). This transformation is selected so that it is consistent with the transformation performed by the USQM 220 in the transmitter 102. Accordingly, the operation of USQM 342 will not be described here in detail. However, it should be understood that the receiver controller 328 communicates a control signal to USQM 342 for controlling whether USQM 342 operates in the first or second operation mode.

In the first operating mode, the USQM 342 is configured to transform each digital chaotic sequence value to a corresponding quadrature form represented by I and Q values. The sequence of I and Q values are constrained so that they define a vector having a magnitude that advantageously remains constant for each I, Q pair in the sequence. Significantly, however, the phase angle defined by each pair of I, Q values will vary from one quadrature pair to the next such that the sequence of quadrature output values has uniformly distributed phase angles within a predefined range of possible phase angles. Stated differently, it can be said that sequence of I, Q values define a sequence of spreading chips having a constant magnitude but variable phase angle characterized by values which are statistically uniformly distributed continuously within a predefined range.

In the second operating mode, the USQM 342 is configured to cause receiver 104 to demodulate a spread spectrum signal which is not CAZAC, but has a selectively variable PAPR. More particularly, in the second operating mode, the USQM 342 is configured to statistically transform a digital chaotic sequence into a transformed digital chaotic sequence with chosen statistical properties. For example, the USQM 342 may take in two (2) uniformly distributed real inputs from the chaos generator 340 and convert those via a complex-valued bivariate Gaussian transformation to a quadrature output. The quadrature output can be chosen to have selectively variable statistical characteristics. For example, the statistical characteristics can be that of additive white Gaussian noise or a selectively modified version of such Gaussian noise having a truncated range of amplitude distributions.

More particularly, in the second operating mode, the quadrature output of USQM 342 is adaptively controlled so that the magnitude values can be selectively restricted to a reduced or truncated range. The reduced or truncated magnitude range can vary between some maximum statistical range associated with the Gaussian noise, and a minimum range, which is the same or approximately the same as the quadrature output produced USQM 342 in the first operating mode.

The USQM 342 is further configured to communicate transformed chaotic sequences to the re-sampling filter 344. The USQM 342 communicates the quadrature form of the digital chaotic sequence to the re-sampling filter 344. More particularly, the USQM 342 communicates an in-phase (“I”) data and quadrature phase (“Q”) data to the re-sampling filter 344. Still, embodiments of the present invention are not limited in this regard.

The re-sampling filter 344 is also configured to forward the transformed chaotic sequence to the digital complex multiplier 324. The re-sampling filter 344 is configured as a sample rate change filter for making the chaos sample rate compatible with the received signal sample rate when the receiver 104 is in acquisition mode. The re-sampling filter 344 is also configured to compensate for transmit and receive clock offsets with less than a certain level of distortion when the receiver is in a steady state demodulation mode. In this regard, it should be appreciated that the re-sampling filter 344 is configured to convert a sampling rate of in-phase (“I”) and quadrature-phase (“Q”) data sequences from a first sampling rate to a second sampling rate without changing the spectrum of the data contained therein. The re-sampling filter 344 is further configured to communicate in-phase (“I”) and quadrature-phase (“Q”) data sequences to the digital complex multipliers 324, 352, and the multiplexers 346, 348.

It should be noted that if a sampled form of a chaotic sequence is thought of as discrete samples of a continuous band limited chaos then the re-sampling filter 344 is effectively tracking the discrete time samples, computing a continuous representation of the chaotic sequence, and re-sampling the chaotic sequence at the discrete time points required to match the discrete time points sampled by the A/D converter 314. In effect, input values and output values of the re-sampling filter 344 are not exactly the same because the values are samples of the same waveform taken at slightly offset times. However, the values are samples of the same waveform so the values have the same power spectral density.

Referring again to FIG. 3, the CEADG 350 is configured to generate a modulated acquisition sequence. The CEADG 350 is also configured to communicate a modulated acquisition sequence to the digital complex multiplier 352. The digital complex multiplier 352 is configured to perform a complex multiplication in the digital domain. This complex multiplication includes multiplying a modulated acquisition sequence from the CEADG 350 by a digital representation of a chaotic sequence to yield a reference for a digital input signal. The digital complex multiplier 352 is also configured to communicate the reference signal to the multiplexers 346, 348. The multiplexer 346 is configured to route the quadrature-phase part of a reference signal to the correlator 328. The multiplexer 348 is configured to route the in-phase part of a reference signal to the correlator 328. In this regard, it should be appreciated that the multiplexers 346, 348 are coupled to the receiver controller 338. The receiver controller 338 is configured to control the multiplexers 346, 348 in tandem so that the multiplexers 346, 348 route the reference signal to the correlator 328 while the receiver 104 is in an acquisition mode (described below).

The correlator 328 is configured to correlate a chaotic sequence with a digital input signal. In this regard, it should be understood that, the sense and values of the real and imaginary components of the correlation is directly related to the values of the real and imaginary components of the symbols of a digital input signal. It should also be understood that, in a preferred embodiment, the sense of the real and imaginary components of the correlation is directly related to the values of the real and imaginary components of the PSK symbols of a digital input signal. Thus, when the correlator 328 is in a steady state demodulation mode the output of the correlator 328 is PSK symbol soft decisions. In this regard, it should be appreciated that soft information refers to soft-values (which are represented by soft-decision bits) that comprise information about the bits contained in a sequence. In particular, soft-values are values that represent the probability that a particular bit in a sequence is either a one (1) or a zero (0). For example, a soft-decision for a particular bit can indicate that a probability of a bit being a one (1) is p(1)=0.3. Conversely, the same bit can have a probability of being a zero (0) which is p(0)=0.7.

The correlator 328 is also configured to communicate PSK soft decisions to the hard decision device 330 for final symbol decision making. The hard decision device 330 is configured to communicate symbol decisions to the S/B converter 332. The S/B converter 332 is configured to convert symbols to a binary form. The S/B converter 332 is configured to communicate a binary data sequence to the source decoder 334. The source decoder 334 is configured to decode FEC applied at the transmitter and to pass the decoded bit stream to one or more external devices (not shown) utilizing the decoded data.

The correlator 328 is also configured to acquire initial timing information associated with a chaotic sequence, initial timing associated with a data sequence and to track phase and frequency offset information between the chaotic sequence and a digital input signal. The correlator 328 is also configured to track input signal magnitude information between the chaotic sequence and a digital input signal. Acquisition of initial timing information and tracking of input signal magnitude, phase and frequency offset information are both standard functions in digital communication systems. As such, methods for acquiring initial timing information and tracking phase and frequency offset information are well known to persons skilled in the art, and therefore will not be described in detail herein. However, it should be appreciated that any such method can be used without limitation.

Referring again to FIG. 3, the correlator 328 is configured to communicate the magnitude and phase information as a function of time to the loop control circuit 320. The loop control circuit 320 uses the magnitude and phase information to calculate the deviation of the input signal magnitude from a nominal range, and phase and frequency offset information to synchronize a chaotic sequence with a digital input signal. The loop control circuit 320 is also configured to communicate the phase and frequency offset information to the quadrature digital local oscillator 322 portion of the IF translator and gain deviation compensation information to the automatic gain control (AGC) amplifier 308. The loop control circuit 320 is further configured to communicate a retiming control signal to the re-sampling filter SRMD 344 and the chaos generator 340.

It should be understood that the digital generation of the digital chaotic sequence at the transmitter 102 and receiver 104 is kept closely coordinated under the control of a precision real time reference clock 336. The higher the precision of the clock 336, the closer the synchronization of the chaos generator 218 of the transmitter 102 and the chaos generator 340 of the receiver 104 shall be excluding the effects of processing delay differences and channel propagation times. It is the use of digital chaos generators 218, 340 that allow the states of the chaos generators to be easily controlled with precision, thus allowing coherent communication.

Referring again to FIG. 3, the precision real time reference clock 336 is a stable local oscillator locked to a precision real time reference, such as a GPS clock receiver or a chip scale atomic clock (CSAC). The precision real time reference clock 336 is configured to supply a high frequency clock to the clocked logic circuits 314, . . . , 356 while being locked to a lower frequency reference clock. The lower frequency reference clock supplies a common reference and a common real time of day reference to prevent a large drift between the states of the chaos generator 218 and the chaos generator 340 of the receiver 104 over an extended time interval.

The operation of the receiver 104 will now be briefly described with regard to an acquisition mode and a steady state demodulation mode.

Acquisition Mode

In acquisition mode, the re-sampling filter 344 performs a rational rate change and forwards a transformed chaotic sequence to the digital complex multiplier 352. The CEADG 350 generates a modulated acquisition sequence and forwards the same to the digital complex multiplier 352. The digital complex multiplier 352 performs a complex multiplication in the digital domain. In the digital complex multiplier 352, a modulated acquisition sequence from the CEADG 350 is multiplied by a digital representation of a chaotic sequence to yield a reference for a digital input signal that was generated at the transmitter 102 to facilitate initial acquisition. The chaotic sequence is generated in the chaos generator 340. The digital complex multiplier 352 communicates a reference signal to the multiplexers 346, 348. The multiplexers 346, 348 route the reference signal to the correlator 328. The correlator 328 is transitioned into a search mode. In this search mode, the correlator 328 searches across an uncertainty window to locate a received signal state so that the chaos generator 340 can be set with the time synchronized state vector.

Steady State Demodulation Mode

In steady state demodulation mode, the correlator 328 tracks the correlation between the received modulated signal and the locally generated chaos close to the nominal correlation peak to generate magnitude and phase information as a function of time. This information is passed to the loop control circuit 320. The loop control circuit 320 applies appropriate algorithmic processing to this information to extract phase offset, frequency offset, and magnitude compensation information. The correlator 328 also passes its output information, based on correlation times terminated by symbol boundaries, to the hard decision block 330. The hard decision block 330 compares the correlation information to pre-determined thresholds to make hard symbol decisions. The loop control circuit 320 monitors the output of the correlator 318. When the loop control circuit 320 detects fixed correlation phase offsets, the phase control of the quadrature digital local oscillator 322 is modified to remove the phase offset. When the loop control circuit 320 detects phase offsets that change as a function of time, it adjusts the re-sampling filter 344 which acts as an incommensurate re-sampler when the receiver 104 is in steady state demodulation mode to remove timing effects or the frequency control of the quadrature digital local oscillator 322 is modified to remove frequency offsets. When the correlator's 328 output indicates that the received digital input signal timing has “drifted” more than plus or minus a half (½) of a sample time relative to a locally generated chaotic sequence, the loop control circuit 320: (1) adjusts a correlation window in an appropriate temporal direction by one sample time; (2) advances or retards a state of the local chaos generator 340 by one iteration state; and (3) adjusts the re-sampling filter 344 to compensate for the time discontinuity. This loop control circuit 320 process keeps the chaos generator 218 of the transmitter 102 and the chaos generator 340 of the receiver 104 synchronized to within half (½) of a sample time. The loop control circuit 320 monitors the magnitude of the output of the correlator 328 to control the AGC amplifier 308. If the expected value of the magnitudes falls below an a priori determined threshold, then the gain is varied in an increasing direction. If the expected value of the magnitudes rise above another a priori determined threshold, then the gain is varied in a decreasing direction.

If a more precise temporal synchronization is required to enhance performance, then a re-sampling filter can be implemented as a member of the class of polyphase fractional time delay filters. This class of filters is well known to persons skilled in the art, and therefore will not be described in great detail herein.

As described above, a number of chaotic samples are combined with an information symbol at the transmitter 102. Since the transmitter 102 and receiver 104 timing are referenced to two (2) different precision real time reference clock 212, 336 oscillators, symbol timing must be recovered at the receiver 104 to facilitate robust demodulation. Symbol timing recovery can include: (1) multiplying a received input signal by a complex conjugate of a locally generated chaotic sequence using the complex multiplier 324; (2) computing an N point running average of the product where N is a number of chaotic samples per symbol time; (3) storing the values, the maximum absolute values of the running averages, and the time of occurrence; and (4) statistically combining the values at the symbol timing recovery circuit 326 to recover symbol timing. It should be noted that symbol timing recover can also be accomplished via an output of the correlator 328. However, additional correlator operations are needed in such a scenario. As should be appreciated, using a separate multiplier operation for this purpose adds additional capabilities to the receiver 104, such as the capability to correlate and post process over multiple correlation windows simultaneously to locate the best statistical fit for symbol timing.

In this steady state demodulation mode, the symbol timing recovery circuit 326 communicates a symbol onset timing to the correlator 328 for controlling an initiation of a symbol correlation. The correlator 328 correlates a locally generated chaotic sequence with a received digital input signal during a symbol duration. In this regard, it should be understood that, the sense and magnitude of a real and imaginary components of the correlation is directly related to the values of the real and imaginary components of symbols of a digital input signal. Accordingly, the correlator 328 generates symbol soft decisions. The correlator 328 communicates the symbol soft decisions to the hard decision device 330 for final symbol decision making. The hard decision device 330 determines symbols using the symbol soft decisions. Thereafter, the hard decision device 330 communicates the symbols to the S/B converter 332. The S/B converter 332 converts the symbol decisions to a binary form. The S/B converter 332 is configured to communicate a binary data sequence to the source decoder 334. The source decoder 334 is configured to decide FEC applied at the transmitter 102 and pass the decoded bit stream to one or more external devices (not shown) utilizing the decoded data.

The receiver controller 338 is configured to coordinate the operation of USQM 342 in the receiver 104 with the operation of USQM 220 in transmitter 102 to provide an adaptive anti-jamming capability for the communication system. The coordinated operation also ensures that USQM 342 produces a chaotic chipping sequence that is an exact replica of the chaotic chipping sequence produced in USQM 220.

Coordination between the transmitter 102 and receiver 104 can be implemented by control messages communicated between receiver 104 and transmitter 102. For example, transmitter controller 210 can cause one or more control messages to be communicated from transmitter 102 to receiver 104. Transmitter 105 is cooperatively associated with receiver 104. Transmitter 105 is configured to cause one or more control messages to be communicated to a receiver 103 that is operatively integrated with the transmitter 102. In this way, bi-directional communications can be provided.

The adaptive power and PAPR capability of the invention will now be described in further detail. A measured or estimated SNR and other signal quality parameter values are detected at receiver 104. The signal quality information is processed at the receiver and thereafter communicated to transmitter 102 or transmitted in raw form using the bi-directional communications described above. When the raw signal quality information is received at transmitter 102, the transmitter controller 210 uses the signal quality information in a control algorithm. The control algorithm, implemented in both embodiments, is described in more detail in relation to FIG. 7. However, it should be understood that the control algorithm is designed to selectively vary the transmitter output power or waveform when necessary for providing increased resistance to adverse channel conditions. In particular, the PAPR of the output signal from transmitter 102 is decreased responsive to increasing values of SNR which indicates the presence of channel attenuation, interference, intentional or unintentional jamming, etc. In acceptable channel conditions, the output signal from transmitter 102 can be a purely chaotic signal that appears to observers as broadband noise and has a potentially higher information capacity. In the presence of severe channel degradation, the output signal from transmitter 102 can be a CAZAC signal with constant power envelope or can have an increased output power at the transmitter. As the PAPR is decreased, the transmitter gain is advantageously increased for maximizing the average power output from the transmitter without transmitter compression.

A person skilled in the art will appreciate that the receiver 104 is one architecture of a communications system receiver. However, the invention is not limited in this regard and any other receiver architecture can be used without limitation.

Chaos Generators and Digital Chaotic Sequence Generation

Referring now to FIG. 4, there is provided a conceptual diagram of a chaos generator 218, 340 (described above in relation to FIGS. 2-3) that is useful for understanding the invention. As shown in FIG. 4, generation of the chaotic sequence begins with N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)). The N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be selected as the same polynomial equation or as different polynomial equations. According to an aspect of the invention, the N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) are selected as irreducible polynomial equations having chaotic properties in Galois field arithmetic. Such irreducible polynomial equations include, but are not limited to, irreducible cubic polynomial equations and irreducible quadratic polynomial equations. The phrase “irreducible polynomial equation” as used herein refers to a polynomial equation that cannot be expressed as a product of at least two nontrivial polynomial equations over the same Galois field (GF). For example, the polynomial equation f(x(nT)) is irreducible if there does not exist two (2) non-constant polynomial equations g(x(nT)) and h(x(nT)) in x(nT) with rational coefficients such that f(x(nT))=g(x(nT))·h(x(nT)).

As will be understood by a person skilled in the art, each of the N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be solved independently to obtain a respective solution. Each solution can be expressed as a residue number system (RNS) residue value using RNS arithmetic operations, i.e. modulo operations. Modulo operations are well known to persons skilled in the art. Thus, such operations will not be described in great detail herein. However, it should be appreciated that a RNS residue representation for some weighted value “a” can be defined by mathematical Equation (1). R={a modulo m₀, a modulo m₁, . . . , a modulo m_(N-1)}  (1) where R is a RNS residue N-tuple value representing a weighted value “a”. Further, R(nT) can be a representation of the RNS solution of a polynomial equation f(x(nT)) defined as R(nT)={f₀(x(nT)) modulo m₀, f₁(x(nT)) modulo m₁, . . . , f_(N-1)(x(nT)) modulo m_(N-1)}. m₀, m₁, . . . , m_(N-1) respectively are the moduli for RNS arithmetic operations applicable to each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)).

From the foregoing, it will be appreciated that the RNS employed for solving each of the polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) respectively has a selected modulus value m₀, m₁, . . . , m_(N-1). The modulus value chosen for each RNS moduli is preferably selected to be relatively prime numbers p₀, p₁, . . . , p_(N-1). The phrase “relatively prime numbers” as used herein refers to a collection of natural numbers having no common divisors except one (1). Consequently, each RNS arithmetic operation employed for expressing a solution as a RNS residue value uses a different prime number p₀, p₁, . . . , p_(N-1) as a modulus m₀, m₁, . . . , m_(N-1).

Those skilled in the art will appreciate that the RNS residue value calculated as a solution to each one of the polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) will vary depending on the choice of prime numbers p₀, p₁, . . . , p_(N-1) selected as a modulus m₀, m₁, . . . , m_(N-1). Moreover, the range of values will depend on the choice of relatively prime numbers p₀, p₁, . . . , p_(N-1) selected as a moduli m₀, m₁, . . . , m_(N-1). For example, if the prime number five hundred three (503) is selected as modulus m₀, then an RNS solution for a first polynomial equation f₀(x(nT)) will have an integer value between zero (0) and five hundred two (502). Similarly, if the prime number four hundred ninety-one (491) is selected as modulus m₁, then the RNS solution for a second polynomial equation f₁(x(nT)) has an integer value between zero (0) and four hundred ninety (490).

According to an embodiment of the invention, each of the N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) is selected as an irreducible cubic polynomial equation having chaotic properties in Galois field arithmetic. Each of the N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can also be selected to be a constant or varying function of time. The irreducible cubic polynomial equation is defined by a mathematical Equation (2). f(x(nT))=Q(k)x ³(nT)+R(k)x ²(nT)+S(k)x(nT)+C(k,L)   (2) where n is a sample time index value. k is a polynomial time index value. L is a constant component time index value. T is a fixed constant having a value representing a time interval or increment. Q, R, and S are coefficients that define the polynomial equation f(x(nT)). C is a coefficient of x(nT) raised to a zero power and is therefore a constant for each polynomial characteristic. In a preferred embodiment, a value of C is selected which empirically is determined to produce an irreducible form of the stated polynomial equation f(x(nT)) for a particular prime modulus. For a given polynomial with fixed values for Q, R, and S more than one value of C can exist, each providing a unique iterative sequence. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, the N polynomial equations f₀(x(nT)) . . . f_(N-1)(x(nT)) are identical exclusive of a constant value C. For example, a first polynomial equation f₀(x(nT)) is selected as f₀(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₀. A second polynomial equation f₁(x(nT)) is selected as f₁(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₁. A third polynomial equation f₂(x(nT)) is selected as f₂(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₂, and so on. Each of the constant values C₀, C₁, . . . , C_(N-1) is selected to produce an irreducible form in a residue ring of the stated polynomial equation f(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C. In this regard, it should be appreciated that each of the constant values C₀, C₁, . . . , C_(N-1) is associated with a particular modulus m₀, m₁, . . . , m_(N-1) value to be used for RNS arithmetic operations when solving the polynomial equation f(x(nT)). Such constant values C₀, C₁, . . . , C_(N-1) and associated moduli m₀, m₁, . . . , m_(N-1) values which produce an irreducible form of the stated polynomial equation f(x(nT)) are listed in the following Table (1).

TABLE 1 Moduli values Sets of constant values m₀, m₁, . . . , m_(N−1): C₀, C₁, . . . , C_(N−1): 3 {1, 2} 5 {1, 3} 11 {4, 9} 29 {16, 19} 47 {26, 31} 59 {18, 34} 71 {10, 19, 20, 29} 83 {22, 26, 75, 79} 101 {27, 38, 85, 96} 131 {26, 39, 77, 90} 137 {50, 117} 149 {17, 115, 136, 145} 167 {16, 32, 116, 132} 173 {72, 139} 197 {13, 96, 127, 179} 233 {52, 77} 251 {39, 100, 147, 243} 257 {110, 118} 269 {69, 80} 281 {95, 248} 293 {37, 223} 311 {107, 169} 317 {15, 55} 347 {89, 219} 443 {135, 247, 294, 406} 461 {240, 323} 467 {15, 244, 301, 425} 479 {233, 352} 491 {202, 234} 503 {8, 271} Still, embodiments of the present invention are not limited in this regard.

The number of discrete magnitude states (dynamic range) that can be generated with the system shown in FIG. 4 will depend on the quantity of polynomial equations N and the modulus values m₀, m₁, . . . , m_(N-1) selected for the RNS number systems. In particular, this value can be calculated as the product M=m₀·m₁,·m₃·m₄· . . . ·m_(N-1).

Referring again to FIG. 4, it should be appreciated that each of the RNS solutions Nos. 1 through N is expressed in a binary number system representation. As such, each of the RNS solutions Nos. 1 through N is a binary sequence of bits. Each bit of the sequence has a zero (0) value or a one (1) value. Each binary sequence has a bit length selected in accordance with a particular modulus.

According to an embodiment of the invention, each binary sequence representing a residue value has a bit length (BL) defined by a mathematical Equation (3). BL=Ceiling[Log2(m)]  (3) where m is selected as one of moduli m₀, m₁, . . . , m_(N-1). Ceiling[u] refers to a next highest whole integer with respect to an argument u.

In order to better understand the foregoing concepts, an example is useful. In this example, six (6) relatively prime moduli are used to solve six (6) irreducible polynomial equations f₀(x(nT)), . . . , f₅(x(nT)). A prime number p₀ associated with a first modulus m₀ is selected as five hundred three (503). A prime number p₁ associated with a second modulus m₁ is selected as four hundred ninety one (491). A prime number p₂ associated with a third modulus m₂ is selected as four hundred seventy-nine (479). A prime number p₃ associated with a fourth modulus m₃ is selected as four hundred sixty-seven (467). A prime number p₄ associated with a fifth modulus m₄ is selected as two hundred fifty-seven (257). A prime number p₅ associated with a sixth modulus m₅ is selected as two hundred fifty-one (251). Possible solutions for f₀(x(nT)) are in the range of zero (0) and five hundred two (502) which can be represented in nine (9) binary digits. Possible solutions for f₁(x(nT)) are in the range of zero (0) and four hundred ninety (490) which can be represented in nine (9) binary digits. Possible solutions for f₂(x(nT)) are in the range of zero (0) and four hundred seventy eight (478) which can be represented in nine (9) binary digits. Possible solutions for f₃(x(nT)) are in the range of zero (0) and four hundred sixty six (466) which can be represented in nine (9) binary digits. Possible solutions for f₄(x(nT)) are in the range of zero (0) and two hundred fifty six (256) which can be represented in nine (9) binary digits. Possible solutions for f₅(x(nT)) are in the range of zero (0) and two hundred fifty (250) which can be represented in eight (8) binary digits. Arithmetic for calculating the recursive solutions for polynomial equations f₀(x(nT)), . . . , f₄(x(nT)) requires nine (9) bit modulo arithmetic operations. The arithmetic for calculating the recursive solutions for polynomial equation f₅(x(nT)) requires eight (8) bit modulo arithmetic operations. In aggregate, the recursive results f₀(x(nT)), . . . , f₅(x(nT)) represent values in the range from zero (0) to M-1. The value of M is calculated as follows: p₀·p₁·p₂·p₃·p₄·p₅=503·491·479·467·257·251=3,563,762,191,059,523. The binary number system representation of each RNS solution can be computed using Ceiling[Log2(3,563,762,191,059,523)]=Ceiling[51.66]=52 bits. Because each polynomial is irreducible, all 3,563,762,191,059,523 possible values are computed resulting in a sequence repetition time of every M times T seconds, i.e, a sequence repetition times an interval of time between exact replication of a sequence of generated values. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 4, the RNS solutions Nos. 1 through N are mapped to a weighted number system representation thereby forming a chaotic sequence output. The phrase “weighted number system” as used herein refers to a number system other than a residue number system. Such weighted number systems include, but are not limited to, an integer number system, a binary number system, an octal number system, and a hexadecimal number system.

According to an aspect of the invention, the RNS solutions Nos. 1 through N are mapped to a weighted number system representation by determining a series of digits in the weighted number system based on the RNS solutions Nos. 1 through N. The term “digit” as used herein refers to a symbol or a combination of symbols to represent a number. For example, a digit can be a particular bit of a binary sequence. According to another aspect of the invention, the RNS solutions Nos. 1 through N are mapped to a weighted number system representation by identifying a number in the weighted number system that is defined by the RNS solutions Nos. 1 through N. According to yet another aspect of the invention, the RNS solutions Nos. 1 through N are mapped to a weighted number system representation by identifying a truncated portion of a number in the weighted number system that is defined by the RNS solutions Nos. 1 through N. The truncated portion can include any serially arranged set of digits of the number in the weighted number system. The truncated portion can also be exclusive of a most significant digit of the number in the weighted number system. The phrase “truncated portion” as used herein refers to a chaotic sequence with one or more digits removed from its beginning and/or ending. The phrase “truncated portion” also refers to a segment including a defined number of digits extracted from a chaotic sequence. The phrase “truncated portion” also refers to a result of a partial mapping of the RNS solutions Nos. 1 through N to a weighted number system representation.

According to an embodiment of the invention, a mixed-radix conversion method is used for mapping RNS solutions Nos. 1 through N to a weighted number system representation. “The mixed-radix conversion procedure to be described here can be implemented in” [modulo moduli only and not modulo the product of moduli.] See Residue Arithmetic and Its Applications To Computer Technology, written by Nicholas S. Szabo & Richard I. Tanaka, McGraw-Hill Book Co., New York, 1967. To be consistent with said reference, the following discussion of mixed radix conversion utilizes one (1) based variable indexing instead of zero (0) based indexing used elsewhere herein. In a mixed-radix number system, “a number x may be expressed in a mixed-radix form:

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; R_{i}}} + \ldots + {a_{3}R_{1}R_{2}} + {a_{2}R_{1}} + a_{1}}$ where the R_(i) are the radices, the a_(i) are the mixed-radix digits, and 0≦a_(i)<R_(i). For a given set of radices, the mixed-radix representation of x is denoted by (a_(n), a_(n-1), . . . , a₁) where the digits are listed in order of decreasing significance.” See Id. “The multipliers of the digits a_(i) are the mixed-radix weights where the weight of a_(i) is

${{{\prod\limits_{j = 1}^{i - 1}\;{R_{j\mspace{14mu}}{for}\mspace{14mu} i}} \neq 1.}"}\mspace{14mu}{See}\mspace{14mu}{{Id}.}$

For conversion from the RNS to a mixed-radix system, a set of moduli are chosen so that m_(i)=R_(i). A set of moduli are also chosen so that a mixed-radix system and a RNS are said to be associated. “In this case, the associated systems have the same range of values, that is

$\prod\limits_{i = 1}^{N}\;{m_{i}.}$

The mixed-radix conversion process described here may then be used to convert from the [RNS] to the mixed-radix system.” See Id.

“If m_(i)=R_(i), then the mixed-radix expression is of the form:

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}$ where a_(i) are the mixed-radix coefficients. The a_(i) are determined sequentially in the following manner, starting with a₁.” See Id.

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}$ is first taken modulo m₁. “Since all terms except the last are multiples of m₁, we have

x

_(m) ₁ =a₁. Hence, a₁ is just the first residue digit.” See Id.

“To obtain a₂, one first forms x-a₁ in its residue code. The quantity x-a₁ is obviously divisible by m₁. Furthermore, m₁ is relatively prime to all other moduli, by definition. Hence, the division remainder zero procedure [Division where the dividend is known to be an integer multiple of the divisor and the divisor is known to be relatively prime to M] can be used to find the residue digits of order 2 through N of

$\frac{x - a_{1}}{m_{1}}.$ Inspection of

$\left\lbrack {x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}} \right\rbrack$ shows then that x is a₂. In this way, by successive subtracting and dividing in residue notation, all of the mixed-radix digits may be obtained.” See Id.

“It is interesting to note that

${a_{1} = \left\langle x \right\rangle_{m_{1}}},{a_{2} = \left\langle \left\lfloor \frac{x}{m_{1}} \right\rfloor \right\rangle_{m_{2}}},{a_{3} = \left\langle \left\lfloor \frac{x}{m_{1}m_{2}} \right\rfloor \right\rangle_{m_{3}}}$ and in general for i>1

${a_{i} = {\left\langle \left\lfloor \frac{x}{m_{1}m_{2}\mspace{14mu}\ldots\mspace{14mu} m_{i - 1}} \right\rfloor \right\rangle_{m_{i}}.}}"$ See Id. From the preceding description it is seen that the mixed-radix conversion process is iterative. The conversion can be modified to yield a truncated result. Still, embodiments of the present invention are not limited in this regard.

According to another embodiment of the invention, a Chinese remainder theorem (CRT) arithmetic operation is used to map the RNS solutions Nos. 1 through N to a weighted number system representation. The CRT arithmetic operation is well known in the art and therefore will not be described here in detail. The first known formulation of the Chinese Remainder Theorem is attributed to Sunzi in his “Book of Arithmetics” circa 500 A.D. However, a brief discussion of how the CRT is applied may be helpful for understanding the invention. The CRT arithmetic operation can be defined by a mathematical Equation (4) [returning to zero (0) based indexing].

$\begin{matrix} {{Y({nT})} = \left\langle \begin{matrix} {{\left\langle {\left\lbrack {{3{x_{0}^{3}({nT})}} + {3{x_{0}^{2}({nT})}} + {x_{0}({nT})} + C_{0}} \right\rbrack b_{0}} \right\rangle_{p_{0}}\frac{M}{p_{0}}} + \ldots +} \\ {\left\langle {\left\lbrack {{3{x_{N - 1}^{3}({nT})}} + {3{x_{N - 1}^{2}({nT})}} + {x_{N - 1}({nT})} + C_{N - 1}} \right\rbrack b_{N - 1}} \right\rangle_{p_{N - 1}}\frac{M}{p_{N - 1}}} \end{matrix} \right\rangle_{M}} & (4) \end{matrix}$ Mathematical Equation (4) can be re-written in iterative form as mathematical Equation (5).

$\begin{matrix} {{Y({nT})} = \left\langle \begin{matrix} {{\left\langle {\left\lbrack {{3{x_{0}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3{x_{0}^{2}\left( {\left( {n - 1} \right)T} \right)}} + {x_{0}\left( {\left( {n - 1} \right)T} \right)} + C_{0}} \right\rbrack b_{0}} \right\rangle_{p_{0}}\frac{M}{p_{0}}} + \ldots +} \\ {\left\langle {\left\lbrack {{3{x_{N - 1}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3{x_{N - 1}^{2}\left( {\left( {n - 1} \right)T} \right)}} + {x_{N - 1}\left( {\left( {n - 1} \right)T} \right)} + C_{N - 1}} \right\rbrack b_{N - 1}} \right\rangle\frac{M}{p_{N - 1}}} \end{matrix} \right\rangle_{M}} & (5) \end{matrix}$ where Y(nT) is the result of the CRT arithmetic operation. n is a sample time index value. T is a fixed constant having a value representing a time interval or increment. x₀-x_(N-1) are RNS solutions Nos. 1 through N. p₀, p₁, . . . , p_(N-1) are relatively prime numbers. M is a fixed constant defined by a product of the relatively prime numbers p₀, p₁, . . . p_(N-1). b₀, b₁, . . . , b_(N-1) are fixed constants that are chosen as the multiplicative inverses of the product of all other primes modulo p₀, p₁, . . . , p_(N-1), respectively. Equivalently,

$b_{j} = {\left( \frac{M}{p_{j}} \right)^{- 1}{mod}\mspace{14mu}{p_{j}.}}$

The b_(j)'s enable an isomorphic mapping between an RNS N-tuple value representing a weighted number and the weighted number. However without loss of chaotic properties, the mapping need only be unique and isomorphic. As such, a weighted number x can map into a tuple y. The tuple y can map into a weighted number z. The weighted number x is not equal to z as long as all tuples map into unique values for z in a range from zero (0) to M-1. Thus, all b_(j)'s can be set equal to one or more non-zero values without loss of the chaotic properties.

As should be appreciated, the chaotic sequence output Y(nT) can be expressed in a binary number system representation. As such, the chaotic sequence output Y(nT) can be represented as a binary sequence. Each bit of the binary sequence has a zero (0) value or a one (1) value. The chaotic sequence output Y(nT) can have a maximum bit length (MBL) defined by a mathematical Equation (6). MBL=Ceiling[Log2(M)]  (6) where M is the product of the relatively prime numbers p₀, p₁, . . . , p_(N-1) selected as moduli m₀, m₁, m_(N-1). In this regard, it should be appreciated that M represents a dynamic range of a CRT arithmetic operation. The phrase “dynamic range” as used herein refers to a maximum possible range of outcome values of a CRT arithmetic operation.

According to an embodiment of the invention, M equals three quadrillion five hundred sixty-three trillion seven hundred sixty-two billion one hundred ninety-one million fifty-nine thousand five hundred twenty-three (3,563,762,191,059,523). By substituting the value of M into Equation (6), the bit length (BL) for a chaotic sequence output Y(nT) expressed in a binary system representation can be calculated as follows: BL=Ceiling[Log2(3,563,762,191,059,523)=52 bits. As such, the chaotic sequence output Y(nT) is a fifty-two (52) bit binary sequence having an integer value between zero (0) and three quadrillion five hundred sixty-three trillion seven hundred sixty-two billion one hundred ninety-one million fifty-nine thousand five hundred twenty-two (3,563,762,191,059,522), inclusive. Still, embodiments of the present invention are not limited in this regard. For example, chaotic sequence output Y(nT) can be a binary sequence representing a truncated portion of a value between zero (0) and M-1. In such a scenario, the chaotic sequence output Y(nT) can have a bit length less than Ceiling[Log2(M)]. It should be noted that while truncation affects the dynamic range of the system it has no effect on the periodicity of a generated sequence.

As should be appreciated, the above-described chaotic sequence generation can be iteratively performed. In such a scenario, a feedback mechanism (e.g., a feedback loop) can be provided so that a variable “x” of a polynomial equation can be selectively defined as a solution computed in a previous iteration. Mathematical Equation (2) can be rewritten in a general iterative form: f(x(nT)=Q(k)x³((n-1)T)+R(k)x²((n-1)T)+S(k)x((n-1)T)+C(k,L). For example, a fixed coefficient polynomial equation is selected as f(x(n·1 ms))=3x³((n-1)·1 ms)+3x²((n-1)·1 ms)+x((n-1)·1 ms)+8 modulo 503. n is a variable having a value defined by an iteration being performed. x is a variable having a value allowable in a residue ring. In a first iteration, n equals one (1) and x is selected as two (2) which is allowable in a residue ring. By substituting the value of n and x into the stated polynomial equation f(x(nT)), a first solution having a value forty-six (46) is obtained. In a second iteration, n is incremented by one and x equals the value of the first solution, i.e., forty-six (46) resulting in the solution 298, 410 mod 503 or one hundred thirty-one (131). In a third iteration, n is again incremented by one and x equals the value of the second solution.

Referring now to FIG. 5, there is provided a flow diagram of a method 500 for generating a chaotic sequence that is useful for understanding the invention. As shown in FIG. 5, the method 500 begins with step 502 and continues with step 504. In step 504, a plurality of polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) are selected. In this regard, it should be appreciated that the polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be selected as the same polynomial equation except for a different constant term or different polynomial equations. After step 504, step 506 is performed where a determination for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is made as to which combinations of RNS moduli m₀, m₁, . . . , m_(N-1) used for arithmetic operations and respective constant values C₀, C₁, . . . , C_(N-1) generate irreducible forms of each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)). In step 508, a modulus is selected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) that is to be used for RNS arithmetic operations when solving the polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)). In this regard, it should be appreciated that the modulus is selected from the moduli identified in step 506. It should also be appreciated that a different modulus must be selected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)).

As shown in FIG. 5, the method 500 continues with a step 510. In step 510, a constant C_(m) is selected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) for which a modulus is selected. Each constant C_(m) corresponds to the modulus selected for the respective polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)). Each constant C_(m) is selected from among the possible constant values identified in step 506 for generating an irreducible form of the respective polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)).

After step 510, the method 500 continues with step 512. In step 512, a value for time increment “T” is selected. Thereafter, an initial value for “x” is selected. In this regard, it should be appreciated that the initial value for “x” can be any value allowable in a residue ring. Subsequently, step 516 is performed where RNS arithmetic operations are used to iteratively determine RNS solutions for each of the stated polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)). In step 518, a series of digits in a weighted number system are determined based in the RNS solutions. This step can involve performing a mixed radix arithmetic operation or a CRT arithmetic operation using the RNS solutions to obtain a chaotic sequence output.

After step 518, the method 500 continues with a decision step 520. If a chaos generator is not terminated (520:NO), then step 524 is performed where a value of “x” in each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is set equal to the RNS solution computed for the respective polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) in step 516. Subsequently, the method 500 returns to step 516. If the chaos generator is terminated (520:YES), then step 522 is performed where the method 500 ends.

A person skilled in the art will appreciate that the method 500 is one architecture of a method for digitally generating a chaotic sequence. However, the invention is not limited in this regard and any other method for generating a chaotic sequence can be used without limitation.

Referring now to FIG. 6, there is illustrated one embodiment of a chaos generator 218. The chaos generator 218 is comprised of hardware and/or software configured to generate a digital chaotic sequence. In this regard, it should be appreciated that the chaos generator 218 is comprised of computing processors 602 ₀-602 _(N-1). The chaos generator 218 is also comprised of a mapping processor 604. Each computing processor 602 ₀-602 _(N-1) is coupled to the mapping processor 604 by a respective data bus 606 ₀-606 _(N-1). As such, each computing processor 602 ₀-602 _(N-1) is configured to communicate data to the mapping processor 604 via a respective data bus 606 ₀-606 _(N-1). The mapping processor 604 can be coupled to an external device (not shown) via a data bus 608. In this regard, it should be appreciated that the external device (not shown) includes, but is not limited to, a communications device configured to combine or modify a signal in accordance with a chaotic sequence output.

Referring again to FIG. 6, the computing processors 602 ₀-602 _(N-1) are comprised of hardware and/or software configured to solve N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) to obtain a plurality of solutions. The N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be irreducible polynomial equations having chaotic properties in Galois field arithmetic. Such irreducible polynomial equations include, but are not limited to, irreducible cubic polynomial equations and irreducible quadratic polynomial equations. The N polynomial equations f₀(x(nT)) . . . f_(N-1)(x(nT)) can also be identical exclusive of a constant value. The constant value can be selected so that a polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is irreducible for a predefined modulus. The N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can further be selected as a constant or varying function of time.

Each of the solutions can be expressed as a unique residue number system (RNS) N-tuple representation. In this regard, it should be appreciated that the computing processors 602 ₀-602 _(N-1) employ modulo operations to calculate a respective solution for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) using modulo based arithmetic operations. Each of the computing processors 602 ₀-602 _(N-1) are comprised of hardware and/or software configured to utilize a different relatively prime number p₀, p₁, . . . , p_(N-1) as a modulus m₀, m₁, . . . , m_(N-1) for modulo based arithmetic operations. The computing processors 602 ₀-602 _(N-1) are also comprised of hardware and/or software configured to utilize modulus m₀, m₁, . . . , m_(N-1) selected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) so that each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is irreducible. The computing processors 602 ₀-602 _(N-1) are further comprised of hardware and/or software configured to utilize moduli m₀, m₁, . . . , m_(N-1) selected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) so that solutions iteratively computed via a feedback mechanism 610 ₀-610 _(N-1) are chaotic. In this regard, it should be appreciated that the feedback mechanisms 610 ₀-610 _(N-1) are provided so that the solutions for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be iteratively computed. Accordingly, the feedback mechanisms 610 ₀-610 _(N-1) are comprised of hardware and/or software configured to selectively define a variable “x” of a polynomial equation as a solution computed in a previous iteration.

Referring again to FIG. 6, the computing processors 602 ₀-602 _(N-1) are further comprised of hardware and/or software configured to express each of the RNS residue values in a binary number system representation. In this regard, the computing processors 602 ₀-602 _(N-1) can employ an RNS-to-binary conversion method. Such methods are generally known to persons skilled in the art and therefore will not be described in great detail herein. However, it should be appreciated that any such method can be used without limitation. It should also be appreciated that the residue values expressed in binary number system representations are hereinafter referred to as moduli solutions Nos. 1 through N comprising the elements of an RNS N-tuple.

According to an embodiment of the invention, the computing processors 602 ₀-602 _(N-1) are further comprised of memory based tables (not shown) containing pre-computed residue values in a binary number system representation. The address space of each memory table is at least from zero (0) to m_(m)-1 for all m, m₀ through m_(N-1). On each iteration, the table address is used to initiate the sequence. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 6, the mapping processor 604 is comprised of hardware and/or software configured to map the moduli (RNS N-tuple) solutions Nos. 1 through N to a weighted number system representation. The result is a series of digits in the weighted number system based on the moduli solutions Nos. 1 through N. For example, the mapping processor 604 can be comprised of hardware and/or software configured to determine the series of digits in the weighted number system based on the RNS residue values using a Chinese Remainder Theorem process. In this regard, it will be appreciated by those skilled in the art that the mapping processor 604 is comprised of hardware and/or software configured to identify a number in the weighted number system that is defined by the moduli solutions Nos. 1 through N.

According to an aspect of the invention, the mapping processor 604 can be comprised of hardware and/or software configured to identify a truncated portion of a number in the weighted number system that is defined by the moduli solutions Nos. 1 through N. For example, the mapping processor 604 can also be comprised of hardware and/or software configured to select the truncated portion to include any serially arranged set of digits of the number in the weighted number system. Further, the mapping processor 604 can include hardware and/or software configured to select the truncated portion to be exclusive of a most significant digit when all possible weighted numbers represented by P bits are not mapped, i.e., when M-1<2^(P). P is a fewest number of bits required to achieve a binary representation of the weighted numbers. Still, embodiments of the present invention are not limited in this regard.

Referring again to FIG. 6, the mapping processor 604 is comprised of hardware and/or software configured to express a chaotic sequence in a binary number system representation. In this regard, it should be appreciated that the mapping processor 604 can employ a weighted-to-binary conversion method. Such methods are generally known to persons skilled in the art and therefore will not be described in great detail herein. However, it should be appreciated that any such method can be used without limitation.

A person skilled in the art will appreciate that the digital chaos generator described in relation to FIGS. 1-6 is provided by way of example and is not intended to limit the invention. In this regard, the digital chaos generator described herein is merely one architecture that can be used to implement a digital chaos generator in the various inventive arrangements. Any other digital chaos generator architecture can be used without limitation Likewise, any other suitable method of generating digital chaos now known, or known in the future can be used to implement the methods of the present invention.

Referring now to FIG. 7, there is shown a flowchart of a method for communicating with the system described in FIGS. 1-6. The method begins in step 702 and continues to step 704. In step 704, communications are initiated between transmitter 102 and receiver 104. In particular, a signal is transmitted using a first or initial spreading sequence S_(i) at an a priori determined nominal power level. The initial spreading sequence S_(i) is advantageously selected to produce a CAZAC waveform as described herein. Recall that the sequence of spreading chips used to produce the CAZAC waveform is selected to define a spreading sequence with a constant magnitude, and having a chaotically varying arbitrary phase angle. It is advantageous to initiate communications with the CAZAC waveform as it offers the potential for higher power transmissions and therefore greater assurance that the link can be established.

In step 706 a determination is made as to whether the signal to interference (S/I) ratio RL_(i)<S/I<RL_(j). If “yes” then the system returns to step 704 and continues to generate the transmitted spread spectrum signal using the spreading sequence S_(i). However, if the S/I ratio is outside the range defined in step 708, then in step 710 a change message is sent from transmitter 102 to notify the remote transceiver device 107 of a change in spreading sequence or transmit power level to occur at time t_(n). The system waits in step 712 for an acknowledgment of this message and if no acknowledgement is received, the change message is re-sent at increasing power levels until an acknowledgment is received. Thereafter, in step 714 the transmitter 102 and the receiver 104 each begin using the new spreading sequence S_(n) or new power level P_(n).

The process continues in step 716 with transmissions using the spreading sequence S_(n) or power level P_(n). In step 718, a determination is again made regarding the signal to interference ratio level at which the transmitted signal from transmitter 102 is being received at the receiver 104. In step 720, the system checks to determine if the signal to interference ratio is within a predetermined range specifically associated with that particular spreading sequence. If so, then the system continues to transmit in step 716 with the current selection of spreading sequence S_(n) and power level P_(n). If it is determined in step 720 that the signal to interference ratio S/I is outside the predetermined range selected for the current spreading sequence S_(n) or transmit power P_(n) then the process continues to step 722. In step 722, the transmitter 101 again notifies the remote transceiver 107 of a change in spreading sequence or power level to occur at time t_(n). If this change notification is acknowledged in step 724, then the system switches to a new sequence S_(n) or new power level P_(n) at time t_(n).

In FIG. 7, the transmitter 102 will select spreading sequences to provide a higher PAPR as the signal to interference ratio increases. Conversely, the transmitter 102 will select spreading sequences to provide lower PAPR as the signal to interference ratio decreases. Also, it should be appreciated that other parameters can be used to determine the particular spreading sequence S_(n) and power level P_(n) that should be used. For example, bit error rate can be used for this purpose. Also, the signal to noise ratio at the receiver 104 can be estimated based on conditions at the transmitter. Also, a distance between the transmitter 102 and the receiver 104 can also be used as a parameter to determine the initial choice of the transmitter's operating parameters that are use used. Finally, the operational parameter messages need not use the same waveform or waveform characteristics as the payload waveform. Parameter change messages may be transmitted with more robust waveforms.

All of the apparatus, methods and algorithms disclosed and claimed herein can be made and executed without undue experimentation in light of the present disclosure. While the invention has been described in terms of preferred embodiments, it will be apparent to those of skill in the art that variations may be applied to the apparatus, methods and sequence of steps of the method without departing from the concept, spirit and scope of the invention. More specifically, it will be apparent that certain components may be added to, combined with, or substituted for the components described herein while the same or similar results would be achieved. All such similar substitutes and modifications apparent to those skilled in the art are deemed to be within the spirit, scope and concept of the invention as defined. 

1. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding a carrier signal with data provided at said power-limited communication transmitter to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence, said chaotic spreading sequence having a magnitude that is constant and a variable arbitrary phase angle comprising phase values which are uniformly distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having an adaptable amplitude characteristic and a zero autocorrelation; detecting current operating conditions of a communication environment; dynamically transforming said spread spectrum signal with a first peak to average power ratio (PAPR) to a chaotic signal with a second PAPR having a higher value than the first PAPR, based on said current operating conditions of the communication environment; and transmitting said chaotic signal from said power-limited communication transmitter to said intended receiver system.
 2. The method according to claim 1, wherein power-limited communication transmitter is configured to transmit information signals comprising data in a digital format.
 3. The method according to claim 2, further comprising selectively modifying said chaotic spreading sequence to induce a pseudorandom or chaotic variation in said magnitude of said chaotic spreading sequence to increase said first PAPR of said spread spectrum signal.
 4. The method according to claim 3, further comprising modifying an average deviation of said magnitude of said chaotic spreading sequence to selectively control said first PAPR of said spread spectrum signal.
 5. The method according to claim 1, further comprising selecting said phase values to have a plurality of uniform distributed phase values, where a number of phases is matched to subsequent signal processing to form a continuous distribution over said predetermined range of angles.
 6. The method according to claim 1, wherein said phase values are chaotically varied for each spreading chip of said chaotic spreading sequence.
 7. The method according to claim 1, wherein said generating step comprises digitally generating a chaotic sequence.
 8. The method according to claim 7, wherein said generating step further comprises selecting a plurality of chaotic polynomial equations, using residue number system (RNS) arithmetic operations to respectively determine a plurality of solutions for said plurality of chaotic polynomial equations, said plurality of solutions iteratively computed and expressed as RNS residue values, and determining a chaotic series of digits in a weighted number system based on said plurality of RNS residue values.
 9. The method according to claim 1, wherein said information signal, said chaotic spreading sequence and said spread spectrum signal are each digital signals comprised of an in-phase and a quadrature component.
 10. The method according to claim 1, further comprising converting said spread spectrum signal from a digital signal to an analog RF spread spectrum signal prior to being transmitted from said power-limited communication transmitter.
 11. The method according to claim 1, further comprising: digitally generating, at said intended receiver system, a de-spreading sequence that is identical to said chaotic spreading sequence; de-spreading said spread spectrum signal by using said de-spreading sequence to recover said information signal; and channel decoding said information signal to recover said data.
 12. The method according to claim 11, further comprising synchronizing said chaotic spreading sequence and said de-spreading sequence.
 13. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding a carrier signal with data provided at said power-limited communication transmitter to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence, said chaotic spreading sequence having a magnitude that is constant and a variable arbitrary phase angle comprising phase values which are uniformly distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having an adaptable amplitude characteristic and a zero autocorrelation; and transmitting said spread spectrum signal from said power-limited communication transmitter to said intended receiver system; wherein said chaotic spreading sequence is selectively modified to induce a pseudorandom or chaotic variation in said magnitude of said chaotic spreading sequence to increase a peak to average power ratio (PAPR) of said spread spectrum signal; wherein an average deviation of said magnitude of said chaotic spreading sequence is modified to selectively control said PAPR of said spread spectrum signal, responsive to a measured signal to interference (S/I) ratio or an estimated S/I ratio; and wherein power-limited communication transmitter is configured to transmit information signals comprising data in a digital format.
 14. The method according to claim 13, wherein said measured or estimated S/I ratio is determined at said intended receiver system, and communicated from said intended receiver system to said power-limited communication transmitter.
 15. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding a carrier signal with data provided at said power-limited communication transmitter to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence, said chaotic spreading sequence having a magnitude that is constant and a variable arbitrary phase angle comprising phase values which are uniformly distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having an adaptable amplitude characteristic and a zero autocorrelation; and transmitting said spread spectrum signal from said power-limited communication transmitter to said intended receiver system; wherein the spreading ratio of said chaotic spreading sequence is selectively varied in response to a measured signal to interference (S/I) ratio or an estimated S/I ratio.
 16. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding, at said power-limited communication transmitter, a carrier signal with data using Phase Shift Keying (PSK) to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence; selecting said chaotic spreading sequence with a constant magnitude, and a chaotically varying arbitrary phase angle including phase values which are band limited and distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having a first peak to average power ratio (PAPR); detecting current operating conditions of a communication environment; dynamically transforming said spread spectrum signal with said first PAPR to a chaotic signal with a second PAPR having a higher value than said first PAPR, based on said current operating conditions of the communication environment; and transmitting said chaotic signal from said power-limited communication transmitter to said intended receiver system; wherein said spread spectrum signal is dynamically transformed to said chaotic signal at least by selectively varying an average deviation of said magnitude of said chaotic spreading sequence.
 17. The method according to claim 16, further comprising dynamically selectively varying a gain of a high power amplifier used for amplifying said spread spectrum signal.
 18. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding, at said power-limited communication transmitter, a carrier signal with data using Phase Shift Keying (PSK) to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence; selecting said chaotic spreading sequence with a pseudo-randomly or chaotically variable magnitude, and a chaotically varying arbitrary phase angle including phase values which are band limited and distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having a peak to average power ratio (PAPR); selectively varying an average deviation of said magnitude of said chaotic spreading sequence to selectively control said PAPR, responsive to a measured signal to interference (S/I) ratio or an estimated S/I ratio; and transmitting said spread spectrum signal from said power-limited communication transmitter to said intended receiver system.
 19. The method according to claim 18, wherein said measured or estimated S/I ratio is determined at said intended receiver system, and communicated from said intended receiver system to said power-limited communication transmitter.
 20. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding, at said power-limited communication transmitter, a carrier signal with data using Phase Shift Keying (PSK) to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence; selecting said chaotic spreading sequence with a pseudo-randomly or chaotically variable magnitude, and a chaotically varying arbitrary phase angle including phase values which are band limited and distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having a peak to average power ratio (PAPR); selectively varying an average deviation of said magnitude of said chaotic spreading sequence to selectively control said PAPR; and transmitting said spread spectrum signal from said power-limited communication transmitter to said intended receiver system; wherein said average deviation is decreased as an S/I ratio decreases.
 21. A method for providing communications link with a power-limited communication transmitter positioned remotely from an intended receiver system, where said communication link is resistant to natural and artificial sources of interference, said method comprising: channel encoding, at said power-limited communication transmitter, a carrier signal with data using Phase Shift Keying (PSK) to form an information signal; generating a chaotic spreading sequence based on a chaotic number sequence; selecting said chaotic spreading sequence with a pseudo-randomly or chaotically variable magnitude, and a chaotically varying arbitrary phase angle including phase values which are band limited and distributed over a predetermined range of angles; forming a spread spectrum signal by multiplying said information signal by said chaotic spreading sequence, said spread spectrum signal having a peak to average power ratio (PAPR); selectively varying an average deviation of said magnitude of said chaotic spreading sequence to selectively control said PAPR; reducing said average deviation to approximately zero in the presence of a maximum predetermined signal to interference level; and transmitting said spread spectrum signal from said power-limited communication transmitter to said intended receiver system. 